Winner determination problem with loss-averse buyers in reverse auctions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Lagrangian Heuristic for Winner Determination Problem in Combinatorial Auctions

We present a Lagrangian-based heuristic LAHA for the Winner Determination Problem in Combinatorial Auctions. The algorithm makes use of the market computing power by applying subgradient optimization with variable fixing. A number of different bid ordering and selection rules are used in our heuristic. Moreover, an effective local search refinement procedure is presented at the end of our algor...

متن کامل

Parameterizing the winner determination problem for combinatorial auctions

Combinatorial auctions (CAs) have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are self-interested. One challenge, however, is that the winner-determination problem (WDP) for combinatorial auctions is NP-hard in the general case. However, there are ways to leverage meaningful structure in the ...

متن کامل

Winner Determination in Multi-Attribute Auctions

The theory of procurement auctions traditionally assumes that the offered quantity and quality is fixed prior to source selection. Multi-attribute reverse auctions allow negotiation over price and qualitative attributes such as color, weight, or delivery time. They promise higher market efficiency through a more effective information exchange of buyer’s preferences and supplier’s offerings. Thi...

متن کامل

Approaches to winner determination in combinatorial auctions

Combinatorial auctions, i.e. auctions where bidders can bid on combinations of items, tend to lead to more eecient allocations than traditional auctions in multi-item auctions where the agents' valuations of the items are not additive. However, determining the winners so as to maximize revenue is NP-complete. First, existing approaches for tackling this problem are reviewed: exhaustive enu-mera...

متن کامل

Scalable Winner Determination in Advertising Auctions

Internet search results are a growing and highly profitable advertising platform. Search providers auction advertising slots to advertisers on their search result pages. Due to the high volume of searches and the users’ low tolerance for search result latency, it is imperative to resolve these auctions fast. Current approaches restrict the expressiveness of bids in order to achieve fast winner ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Frontiers of Engineering Management

سال: 2017

ISSN: 2095-7513

DOI: 10.15302/j-fem-2017019